Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., i...

متن کامل

A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., i...

متن کامل

Diophantine Equations, Presburger Arithmetic and Finite Automata

We show that the use of nite automata provides a decision procedure for Presburger Arithmetic with optimal worst case complexity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2001

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(04)00186-0